Language Invariance and Spectrum Exchangeability in Inductive Logic

نویسندگان

  • Jürgen Landes
  • Jeff B. Paris
  • Alena Vencovská
چکیده

A sufficient condition is given for a probability function in Inductive Logic (with relations of all arities) satisfying spectrum exchangeability to additionally satisfy Language Invariance. This condition is shown to also be necessary in the case of homogeneous probability functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A characterization of the Language Invariant families satisfying Spectrum Exchangeability in Polyadic Inductive Logic

A necessary and sufficient condition in terms of a de Finetti style representation is given for a probability function in Polyadic Inductive Logic to satisfy being part of a Language Invariant family satisfying Spectrum Exchangeability. This theorem is then considered in relation to the unary Carnap and Nix-Paris Continua.

متن کامل

The Theory of spectrum Exchangeability

Spectrum Exchangeability, Sx, is an irrelevance principle of Pure Inductive Logic, and arguably the most natural (but not the only) extension of Atom Exchangeability to polyadic languages. It has been shown1 that all probability functions which satisfy Sx are comprised of a mixture of two essential types of probability functions; heterogeneous and homogeneous functions. We determine the theory ...

متن کامل

Theorem Proving for Maude’s Rewriting Logic Vlad Rusu and Manuel Clavel

We present an approach based on inductive theorem proving for verifying invariance properties of systems specified in Rewriting Logic, an executable specification language implemented (among others) in the Maude tool. Since theorem proving is not directly available for rewriting logic, we define an encoding of rewriting logic into its membership equational (sub)logic. Then, inductive theorem pr...

متن کامل

The principle of signature exchangeability

We investigate the notion of a signature in Polyadic Inductive Logic and study the probability functions satisfying the Principle of Signature Exchangeability. In the binary case, we prove a representation theorem for such functions and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and John...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007